V2V: Vector Embedding of a Graph and Applications
نویسندگان
چکیده
We present V2V, a method for embedding each vertex in a graph as a vector in a fixed dimensional space. Inspired by methods for word embedding such as word2vec, a vertex embedding is computed through enumerating random walks in the graph, and using the resulting vertex sequences to provide the context for each vertex. This embedding allows one to use well-developed techniques from machine learning to solve graph problems such as community detection, graph visualization, and vertex label prediction. We evaluate embeddings produced by V2V through comparing results obtained using V2V with results obtained through a direct application of a graph algorithm, for community detection. Our results show that V2V provides interesting trade-offs among computation time and accuracy.
منابع مشابه
Partitioning Graphs with Costs and Weights on Vertices: Algorithms and Applications
We prove separator theorems in which the size of the separator is minimized with respect to non-negative vertex costs. We show that for any planar graph G there exists a vertex separator of total vertex cost at most c q P v2V (G) (cost(v)) 2 and that this bound is optimal within a constant factor. Moreover such a separator can be found in linear time. This theorem implies a variety of other sep...
متن کاملA Joint Semantic Vector Representation Model for Text Clustering and Classification
Text clustering and classification are two main tasks of text mining. Feature selection plays the key role in the quality of the clustering and classification results. Although word-based features such as term frequency-inverse document frequency (TF-IDF) vectors have been widely used in different applications, their shortcoming in capturing semantic concepts of text motivated researches to use...
متن کاملLink Prediction using Network Embedding based on Global Similarity
Background: The link prediction issue is one of the most widely used problems in complex network analysis. Link prediction requires knowing the background of previous link connections and combining them with available information. The link prediction local approaches with node structure objectives are fast in case of speed but are not accurate enough. On the other hand, the global link predicti...
متن کاملVector Space semi-Cayley Graphs
The original aim of this paper is to construct a graph associated to a vector space. By inspiration of the classical definition for the Cayley graph related to a group we define Cayley graph of a vector space. The vector space Cayley graph ${rm Cay(mathcal{V},S)}$ is a graph with the vertex set the whole vectors of the vector space $mathcal{V}$ and two vectors $v_1,v_2$ join by an edge whenever...
متن کاملDetecting Overlapping Communities in Social Networks using Deep Learning
In network analysis, a community is typically considered of as a group of nodes with a great density of edges among themselves and a low density of edges relative to other network parts. Detecting a community structure is important in any network analysis task, especially for revealing patterns between specified nodes. There is a variety of approaches presented in the literature for overlapping...
متن کامل